The Tukey Depth Characterizes the Atomic Measure
نویسندگان
چکیده
منابع مشابه
ABCDepth: efficient algorithm for Tukey depth
We present a new algorithm for Tukey (halfspace) depth level sets and its implementation. Given d-dimensional data set for any d ≥ 2, the algorithm is based on representation of level sets as intersections of balls in R, and can be easily adapted to related depths (Type D, Zuo and Serfling (Ann. Stat. 28 (2000), 461–482)). The algorithm complexity is O(dn + n log n) where n is the data set size...
متن کاملTukey Depth-based Multivariate Trimmed Means
We investigate the asymptotic behavior of two types of Tukey depth-based multivariate trimmed means. Sufficient conditions for asymptotic normality of these location estimators are given. Two approaches to trimming are distinguished and central limit theorems are derived for each one. Asymptotic normality is proved using Hadamard differentiability of the location functionals. In the one-dimensi...
متن کاملFunctional classification and the random Tukey depth. Practical issues
Depths are used to attempt to order the points of a multidimensional or infinite dimensional set from the “center of the set” to the “outer of it”. There are few definitions of depth which are valid in the functional case. One of them is the so-called random Tukey depth, which is based on some randomly chosen one-dimensional projections and thus varies (randomly) from computation to computation...
متن کاملAbsolute approximation of Tukey depth: Theory and experiments
A Monte Carlo approximation algorithm for the Tukey depth problem in high 5 dimensions is introduced. The algorithm is a generalization of an algorithm presented by 6 Rousseeuw and Struyf (1998). The performance of this algorithm is studied both analyti7 cally and experimentally. 8
متن کاملOutput-sensitive algorithms for Tukey depth and related problems
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algorithms for computing the Tukey depth of a point in various dimensions are considered. The running times of these algorithms depend on the value of the output, making them suited to situations, such as outlier removal, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 2002
ISSN: 0047-259X
DOI: 10.1006/jmva.2001.2052